Two linear programming algorithms for the linear discrete $L\sb {1}$ norm problem

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

Randomized Algorithms for Linear Programming

Algorithms for solving the mixed integer two-level linear programming problem

Several algorithms have been developed to solve the two-level linear programming problem during the past years. In this paper, we will formulate the mixed integer two-level linear programming problem and develop both the exact and heuristic solution procedures based on the branch-and-Lund technique for solving the problem. Computational experience and comparisons will be presented.

Solving fully fuzzy Linear Programming Problem using Breaking Points

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...